Additive Bases without Any Essentialities
نویسنده
چکیده
Let A be a basis for N0 of some order. By an essentiality of A one means a subset P such that A\P is no longer a basis (of any order) and such that P is minimal among all subsets of A with this property. In a recent paper, Deschamps and Farhi asked whether every basis of N0 possesses some such subset. We construct, for every integer h ≥ 2, a basis of order h with no essentialities.
منابع مشابه
Essentialities in Additive Bases
Let A be an asymptotic basis for N0 of some order. By an essentiality of A one means a subset P such that A\P is no longer an asymptotic basis of any order and such that P is minimal among all subsets of A with this property. A finite essentiality of A is called an essential subset. In a recent paper, Deschamps and Farhi asked the following two questions : (i) does every asymptotic basis of N0 ...
متن کاملAdditive Bases without Any Essential Subsets
Let A be a basis for N0 of some order. By an essential subset of A one means a subset P such that A\P is no longer a basis (of any order) and such that P is minimal among all subsets of A with this property. In a recent paper, Deschamps and Farhi asked whether every basis of N0 possesses some such subset. We construct, for every integer h ≥ 2, a basis of order h with no essential subsets. We al...
متن کاملAdditive bases of vector spaces over prime fields
Let Z; be the n-dimensional linear space over the prime field Z,. An additive basis of Z; is a multiset {x,, . . . . x,} c Z;, such that any XE Z; is representable as a Ckl combination of the x;s. Let j(p, n) denote the mmima1 integer t, such that for any t (linear) bases B,, . . . . B, of Z;, the union (with repetitions) vi= r Bi forms an additive basis of Z;. The problem of determining or est...
متن کاملSatisficing search algorithms for selecting near-best bases in adaptive tree-structured wavelet transforms
Satisficing search algorithms are proposed for adaptively selecting near-best basis and near-best frame decompositions in redundant tree-structured wavelet transforms. Any of a variety of additive or non-additive information cost functions can be used as the decision criterion for comparing and selecting nodes when searching through the tree. The algorithms are applicable to tree-structured tra...
متن کاملNear-best Basis Selection Algorithms with Non-additive Information Cost Functions
Search algorithms for finding signal decompositions called near-best bases using decision criteria called non-additive information costs are proposed for selecting bases in wavelet packet transforms. These new methods are compared with the best bases and additive information costs of Coifman and Wickerhauser [1]. All near-best and best bases were also compared with the matching pursuit decompos...
متن کامل